Interesting Sequential Patterns Research Articles

Geo-SigSPM: mining geographically interesting and significant sequential patterns from trajectories

Interesting sequential patterns in human movement trajectories can provide valuable knowledge for urban management, planning, and location-based business. Existing methods for mining such patterns, however, tend not to consider the reduced likeliness of trips with increasing travel cost. Consequently, it is difficult to differentiate the patterns emerging from people’s specific travel interests from those simply due to travel convenience. To solve this problem, this article presents Geo-SigSPM for mining geographically interesting and statistically significant sequential patterns from trajectories. Here, ‘geographically interesting’ patterns are those more frequent than their expected frequencies which consider both the travel cost and non-redundancy of any place in the patterns. To achieve this, Geo-SigSPM formulates the expected frequencies of the patterns based on doubly-constrained human mobility models and the frequencies of their subsequences. A set of statistical tests is also developed to evaluate the identified interesting patterns. Experiments with synthetic and Foursquare check-in datasets demonstrate the efficacy of Geo-SigSPM in discovering geographically interesting patterns, controlling the spurious pattern rate, and discovering patterns that better reflect people’s specific travel interests than the conventional frequency-based pattern mining approach. Geo-SigSPM is a promising solution to improving relevant decision-making when people’s travel preference beyond travel cost is concerned.

WS-BD-Based Two-Level Match: Interesting Sequential Patterns and Bayesian Fuzzy Clustering for Predicting the Web Pages from Weblogs

Abstract The rapid increase in information and technology has led to the increased amount of web pages, which raises the complexity in sticking to relevant web pages, and the visitor suffers due to wastage of time resulting in lack of satisfaction. This paper proposes a web page prediction method using a weighed support and Bhattacharya distance-based (WS-BD) two-level match. The major aim of the proposed method is to attain customer satisfaction. Initially, interesting sequential patterns are obtained using the weighed support that filters the sequential patterns obtained using a PrefixSpan algorithm based on the frequency, duration and recurrence of the web pages. Interesting sequential patterns are clustered using the proposed dice similarity-based Bayesian fuzzy clustering, and the web page is predicted using the two-level match based on Bhattacharya distance. The experimentation is performed using the CTI and MSNBC data which proves the effectiveness of the proposed method. The proposed method shows 9.59, 21.22 and 10.17% improvement than the existing FCM-KNN in terms of precision, recall and F measure for the CTI dataset. Also, the proposed method shows 2.58, 22.17 and 7.83% improvement than the existing FCM-KNN in terms of precision, recall and F measure for the MSNBC dataset.

Efficient Mining of Sequential Patterns in a Sequence Database with Weight Constraint

Sequence pattern mining is one of the essential data mining tasks with broad applications. Many sequence mining algorithms have been developed to find a set of frequent sub-sequences satisfying the support threshold in a sequence database. The main problem in most of these algorithms is they generate huge number of sequential patterns when the support threshold is low and all the sequence patterns are treated uniformly while real sequential patterns have different importance. In this paper, we propose an algorithm which aims to find more interesting sequential patterns, considering the different significance of each data element in a sequence database. Unlike the conventional weighted sequential pattern mining, where the weights of items are preassigned according to the priority or importance, in our approach the weights are set according to the real data and during the mining process not only the supports but also weights of patterns are considered. The experimental results show that the algorithm is efficient and effective in generating more interesting patterns.

Pushing Constraints to Generate Top-K Closed Sequential Graph Patterns

In this paper, the problem of finding sequential patterns from graph databases is investigated. Two serious issues dealt in this paper are efficiency and effectiveness of mining algorithm. A huge volume of sequential patterns has been generated out of which most of them are uninteresting. The users have to go through a large number of patterns to find interesting results. In order to improve the efficiency and effectiveness of the mining process, constraints are more essential. Constraint-based mining is used in many fields of data mining such as frequent pattern mining, sequential pattern mining, and subgraph mining. A novel algorithm called CSGP (Constraint-based Sequential Graph Pattern mining) is proposed for mining interesting sequential patterns from graph databases. CSGP algorithm is revised to mine topk closed patterns and named as TCSGP (Top-k Closed constraint-based Sequential Graph Pattern mining). General Terms Data mining, Graph mining, Constraint-based mining.

On mining complex sequential data by means of FCA and pattern structures

Nowadays data-sets are available in very complex and heterogeneous ways. Mining of such data collections is essential to support many real-world applications ranging from healthcare to marketing. In this work, we focus on the analysis of “complex” sequential data by means of interesting sequential patterns. We approach the problem using the elegant mathematical framework of formal concept analysis and its extension based on “pattern structures”. Pattern structures are used for mining complex data (such as sequences or graphs) and are based on a subsumption operation, which in our case is defined with respect to the partial order on sequences. We show how pattern structures along with projections (i.e. a data reduction of sequential structures) are able to enumerate more meaningful patterns and increase the computing efficiency of the approach. Finally, we show the applicability of the presented method for discovering and analysing interesting patient patterns from a French healthcare data-set on cancer. The quantitative and qualitative results (with annotations and analysis from a physician) are reported in this use-case which is the main motivation for this work.

Finding Interesting Sequential Patterns in Sequence Data Streams via a Time-Interval Weighting Approach

Finding Interesting Sequential Patterns in Sequence Data Streams via a Time-Interval Weighting Approach

Mining Positive and Negative Sequential Pattern in Incremental Transaction Databases

and negative sequential patterns mining is used to discover interesting sequential patterns in a incremental transaction databases, and it is one of the essential data mining tasks widely used in various application fields. Implementation of this approach, construct tree for appended transactions (new upcoming data) and will merge this tree with existing tree (tree of existing transactions) to get the Updated tree. Positive and negative sequential Patterns mining is an aim to find more interesting sequential patterns, considering the minimum support of each data item in a sequence database. Generally, the generation order of data elements is considered to find sequential patterns. Positive sequential patterns states that these items were occur with one and another. Actually the absence of certain itemset may imply the appearance of other itemsets as well. The absence of itemsets thus is becoming measurable in many applications. Negative sequential patterns could assist product recommendation systems to make more accurate decisions. This approach will reduce the mining time for incremental database if the Existing database has lots of transactions and Appended database having few transactions.

Relevant Tiws Pattern Mining With Reduced Search Space

The sequential pattern mining finds all sequential patterns which occurs frequently for a given sequence database whose frequency is no less than the threshold. The weighted sequential pattern mining aims to find more interesting sequential patterns by considering the different significance of each data element in a sequence database. In the conventional weighted sequential pattern mining, pre-assigned weights of data elements are used to get the priorities which are derived from their quantitative information. Generally in sequential pattern mining, the generation order of data is considered to find sequential patterns. However, generation time and time-intervals between the data are also important in real world application domains. Therefore, time-intervals information of data elements can be helpful in finding more interesting sequential patterns. The proposed system presents a framework for finding time-interval weighted sequential (TiWS) patterns in a sequence database. In addition, the CloSpan algorithm is used for mining TiWS patterns in a sequence database which reduces the multiple database scans and the processing time. This is useful in application fields such as web access pattern analysis, customer purchase pattern analysis, DNA sequence analysis, etc.

Comparative analysis of sequence weighting approaches for mining time-interval weighted sequential patterns

Unlike the general sequential pattern mining that considers only the generation order of data elements, mining weighted sequential patterns aims to get more interesting sequential patterns by considering the weights of data elements in a target sequence database in addition to their generation order. In general, for a sequence or a sequential pattern, not only the generation order of data elements but also their generation times and time-intervals are important because they can be helpful in finding more interesting sequential patterns. Applying the mining method of time-interval weighted sequential (TiWS) patterns that has been proposed in our previous work, this paper proposes several sequence weighting approaches to get the time-interval weight of a sequence in mining TiWS patterns for a sequence database, and the effectiveness of each approach in mining TiWS patterns is analyzed through a set of experiments. The proposed sequence weighting approaches may be helpful in obtaining more interesting sequential patterns in mining sequential patterns for a sequence database.

웹 클릭 스트림의 효율적 분석을 위한 시간 간격 제한을 활용한 관심 순차패턴 탐색

웹 관련 기술의 발달 및 스마트폰과 같은 지능형 모바일 서비스 기기의 사용 증가로 인해 오늘날 많은 분야에서 다양한 웹기반 서비스들이 널리 활용되고 있다 이러한 환정에서 개인화 및 지능화된 웹 서비스를 제공하기 위한 연구들이 활발히 진행되고 있으며, 웹 서비스 이용 기록으로부터 생성되는 웹 클릭 스트림에 대한 분석 기술은 관련 기술 중 핵심 기술의 하나이다. 본 논문에서는 순차정보 형태로 발생되는 웹 클릭 스트림에 대한 효율적 분석을 위해서 데이터 스트림 처리에 대한 기본적인 요구사항을 만족하면서 정제된 결과를 얻기 위한 순차패턴 마이닝 방법을 제시한다. 이를 위해서 먼저 순차패턴에 포함되는 단위항목들의 단순 발생 순서뿐만 아니라 발생 시간 정보를 추가로 활용하는 시간 간격 제한 관심 순차패턴을 정의하고, 이어서 웹 클릭 스트림과 같은 데이터 스트림에서 이를 효율적으로 탐색하기 위한 마이닝 방법을 제안한다. 해당 연구 결과는 웹 클릭 스트림뿐만 아니라 전자상거래, 생물정보학 및 USN 환경 등과 같이 데이터 스트림 형태로 정보를 발생시키는 여러 컴퓨터 용용 분야에서 유용하게 활용될 수 있을 것이다. Due to the development of web technologies and the increasing use of smart devices such as smart phone, in recent various web services are widely used in many application fields. In this environment, the topic of supporting personalized and intelligent web services have been actively researched, and an analysis technique on a web-click stream generated from web usage logs is one of the essential techniques related to the topic. In this paper, for efficient analyzing a web-click stream of sequences, a sequential pattern mining technique is proposed, which satisfies the basic requirements for data stream processing and finds a refined mining result. For this purpose, a concept of interesting sequential patterns with a time-interval constraint is defined, which uses not on1y the order of items in a sequential pattern but also their generation times. In addition, A mining method to find the interesting sequential patterns efficiently over a data stream such as a web-click stream is proposed. The proposed method can be effectively used to various computing application fields such as E-commerce, bio-informatics, and USN environments, which generate data as a form of data streams.

순차 데이터 스트림에서 발생 간격 제한 조건을 활용한 빈발 순차 패턴 탐색

순차 패턴 탐색은 데이터 마이닝의 주요 기법 중의 하나로서 웹기반 시스템, 전자상거래, 생물정보학 및 USN 환경 등과 같은 여러 컴퓨터 응용 분야에서 생성되는 데이터를 효율적으로 분석하기 위하여 널리 활용되고 있다. 한편 이들 응용 분야에서 생성되는 정보들은 근래들어 한정적인 데이터 집합이 아닌 구성요소가 지속적으로 생성되는 데이터 스트림 형태로 생성되고 있다. 이러한 상황을 고려하여 데이터 스트림에서 순차패턴 탐색에 대한 연구들도 활발히 진행되고 있다. 하지만 이전의 연구들은 주로 분석 대상 데이터 스트림에서 단순 순차패턴을 구하는 과정에서 마이닝 수행 시간이나 메모리 사용량 등을 줄이는데 초점을 맞추고 있으며, 따라서 해당 데이터 스트림의 특성을 효율적으로 표현할 수 있는 보다 중요하고 의미있는 패턴들을 탐색하기 위한 연구는 거의 진행되지 못하고 있다. 본 논문에서는 데이터 스트림에서 보다 의미있는 순차패턴을 탐색하기 위한 방법으로 구성요소의 발생 간격 제한 조건을 활용한 빈발 순차패턴 탐색 방법을 제안한다. 먼저 발생 간격 정의 기준 및 발생 간격제한 빈발 순차패턴의 개념을 제시하고, 이어서 데이터 스트림에서 발생 간격 제한 조건을 적용하여 빈발 순차패턴을 효율적으로 탐색할 수 있는 마이닝 방법을 제안한다. Sequential pattern mining is one of the essential data mining tasks, and it is widely used to analyze data generated in various application fields such as web-based applications, E-commerce, bioinformatics, and USN environments. Recently data generated in the application fields has been taking the form of continuous data streams rather than finite stored data sets. Considering the changes in the form of data, many researches have been actively performed to efficiently find sequential patterns over data streams. However, conventional researches focus on reducing processing time and memory usage in mining sequential patterns over a target data stream, so that a research on mining more interesting and useful sequential patterns that efficiently reflect the characteristics of the data stream has been attracting no attention. This paper proposes a mining method of sequential patterns over data streams with a gap constraint, which can help to find more interesting sequential patterns over the data streams. First, meanings of the gap for a sequential pattern and gap-constrained sequential patterns are defined, and subsequently a mining method for finding gap-constrained sequential patterns over a data stream is proposed.

Mining weighted sequential patterns in a sequence database with a time-interval weight

Sequential pattern mining, including weighted sequential pattern mining, has been attracting much attention since it is one of the essential data mining tasks with broad applications. The weighted sequential pattern mining aims to find more interesting sequential patterns, considering the different significance of each data element in a sequence database. In the conventional weighted sequential pattern mining, usually pre-assigned weights of data elements are used to get the importance, which are derived from their quantitative information and their importance in real world application domains. In general sequential pattern mining, the generation order of data elements is considered to find sequential patterns. However, their generation times and time-intervals are also important in real world application domains. Therefore, time-interval information of data elements can be helpful in finding more interesting sequential patterns. This paper presents a new framework for finding time-interval weighted sequential (TiWS) patterns in a sequence database and time-interval weighted support (TiW-support) to find the TiWS patterns. In addition, a new method of mining TiWS patterns in a sequence database is also presented. In the proposed framework of TiWS pattern mining, the weight of each sequence in a sequence database is first obtained from the time-intervals of elements in the sequence, and subsequently TiWS patterns are found considering the weight. A series of evaluation results shows that TIWS pattern mining is efficient and helpful in finding more interesting sequential patterns.

Mining Asynchronous Interesting Sequential Patterns based on Frequency and Self-Information

In this paper, we propose new methods and gave a system, called IFMAP , for extracting interesting patterns from a long sequential data based on frequency and self-information, and experimentally evaluate the proposed methods in the application of handling a newspaper article corpus.Sequential data mining methods based on frequency have intensively beenstudied so far. These methods, however, are not effective nor valuable for some applications where almost all high-frequent patterns should beregarded just as meaningless noisy patterns. An information-gain concept is quite important in order to restrain these noisy patterns, and was already studied for integrating it with a frequency criteria. Yang et.~al. gave a sequential mining system InfoMiner which can find periodic synchronous patterns being interesting and well-balanced from the both view-points of frequency and self-information. In this paper, we refine and extend the InfoMiner technologies in the following points: firstly, our method can handle ordinary, i.e., asynchronous and non-periodic patterns by using a sliding window mechanism, whereas InfoMiner cannot; secondly we give several combination measures for choosing valuable patterns based on frequency and self-information, while InfoMiner has just one measure which, we show in this paper, is not appropriate nor effective for handling newspaper article corpora; thirdly, we proposed a new unified method for pruning the search space of sequential data mining, which can uniformally be applied to any combination measures proposed here. We conduct experiments for evaluating the effectiveness and efficiency of the proposed method with respect to the runtime and the amount of excluding noisy patterns.

WIS: Weighted Interesting Sequential Pattern Mining with a Similar Level of Support and/or Weight

Sequential pattern mining has become an essential task with broad applications. Most sequential pattern mining algorithms use a minimum support threshold to prune the combinatorial search space. This strategy provides basic pruning; however, it cannot mine correlated sequential patterns with similar support and/or weight levels. If the minimum support is low, many spurious patterns having items with different support levels are found; if the minimum support is high, meaningful sequential patterns with low support levels may be missed. We present a new algorithm, weighted interesting sequential (WIS) pattern mining based on a pattern growth method in which new measures, sequential s-confidence and w-confidence, are suggested. Using these measures, weighted interesting sequential patterns with similar levels of support and/or weight are mined. The WIS algorithm gives a balance between the measures of support and weight, and considers correlation between items within sequential patterns. A performance analysis shows that WIS is efficient and scalable in weighted sequential pattern mining.

COMPARISON OF INTERESTINGNESS MEASURES FOR WEB USAGE MINING: AN EMPIRICAL STUDY

A common problem in mining association rules or sequential patterns is that a large number of rules or patterns can be generated from a database, making it impossible for a human analyst to digest the results. Solutions to the problem include, among others, using interestingness measures to identify interesting rules or patterns and pruning rules that are considered redundant. Various interestingness measures have been proposed, but little work has been reported on the effectiveness of the measures on real-world applications. We present an application of Web usage mining to a large collection of Livelink log data. Livelink is a web-based product of Open Text Corporation, which provides automatic management and retrieval of different types of information objects over an intranet, an extranet or the Internet. We report our experience in preprocessing raw log data, mining association rules and sequential patterns from the log data, and identifying interesting rules and patterns by use of interestingness measures and some pruning methods. In particular, we evaluate a number of interestingness measures in terms of their effectiveness in finding interesting association rules and sequential patterns. Our results show that some measures are much more effective than others.

First-order temporal pattern mining with regular expression constraints

Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequential patterns, such as the multi-sequential patterns, whose specification needs a more expressive formalism, the first-order temporal logic. Multi-sequential patterns appear in different application contexts, for instance in spatial census data mining, which is the target application of the study developed in this paper. We extend a well-known user-controlled tool, based on regular expressions constraints, to the multi-sequential pattern context. This specification tool enables the incorporation of user focus into the mining process. We present MSP-Miner, an Apriori-based algorithm to discover all frequent multi-sequential patterns satisfying a user-specified regular expression constraint.

Mining interesting sequential patterns for intelligent systems

Mining sequential patterns means to discover sequential purchasing behaviors of most customers from a large number of customer transactions. Past transaction data can be analyzed to discover customer purchasing behaviors such that the quality of business decisions can be improved. However, the size of the transaction database can be very large. It is very time consuming to find all the sequential patterns from a large database, and users may be only interested in some sequential patterns. Moreover, the criteria of the discovered sequential patterns for user requirements may not be the same. Many uninteresting sequential patterns for user requirements can be generated when traditional mining methods are applied. Hence, a data mining language needs to be provided such that users can query only knowledge of interest to them from a large database of customer transactions. In this article, a data mining language is presented. From the data mining language, users can specify the items of interest and the criteria of the sequential patterns to be discovered. Also, an efficient data mining technique is proposed to extract the sequential patterns according to the users' requests. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 73–87, 2005.